ReverseStack.java

packagesection10_Stacks;

publicclassReverseStack {

publicstaticvoidmain(String[] args) throwsException {

StackUsingArraystack1 = newStackUsingArray(5);
for (inti = 10; i <= 50; i += 10) {
stack1.push(i);
 }
stack1.display();

StackUsingArrayhelperStack = newStackUsingArray(5);
intcurrentDataPos = 0;

reverseStack(stack1, helperStack, currentDataPos);
System.out.println("\n after reversing stack...\n");
stack1.display();
 }

staticvoidreverseStack(StackUsingArraystack1, StackUsingArrayhelper, intid) throwsException {

if (stack1.isEmpty())
return;

intcurrentItem = stack1.pop();
reverseStack(stack1, helper, id + 1);

helper.push(currentItem);

if (id == 0) {
while (!helper.isEmpty()) {
stack1.push(helper.pop());
 }
 }
 }
}